KERALA UNIVERSITY Class 4 formal languages and automata theory Question Paper 2022

Practice authentic previous year questions for better exam preparation.

Sample Questions

Construct a finile automaton that accepts strings not ending in 1 from the sel of slrings in (0+1)
Prove that the language $L=\left\{a^{n} b^{n} \mid n>0\right\}$ is not regular.
Write noles on Chornsky hierarchy of languages,
Give a CFG that generales the language $L=\left\{0^{\circ} 1^{2 n} \mid n>0\right\}$.
Deline Turing Machine. What are its uses? $$ \text { ( } 5 \times 4=20 \text { Marks) } $$ Answer one full question from each module. Each question carries 20 marks.